√天堂资源网最新版在线,久久高清超碰av热热久久

TranslationMobile

最大限度

"maximum" in Chinese : n. (pl. maximums, -ma ) 極點，最 ...
"degree" in Chinese : n. 1.程度；等級。 2.階層，地位。 3.學位，學術(shù) ...
"degree greater than maximum" in Chinese : 階數(shù)大于最大值
"maximum parallelism degree" in Chinese : 最大并行度
"maximum vacuum degree" in Chinese : 最大真空度
"degree" in Chinese : n. 1.程度；等級。 2.階層，地位。 3.學位，學術(shù)。 4.度，度數(shù)。 ...
"degree of" in Chinese : 真實度
"in … degree" in Chinese : 在……速度上
"to a degree" in Chinese : 非常, 有點; 在某種程度上
"to …degree" in Chinese : 到……的程度; 在……程度上
"to…degree" in Chinese : 達到…程度
"maximum" in Chinese : n. (pl. maximums, -ma ) 極點，最大，最高，最高額，最 ...
"maximum maximum" in Chinese : 極大值
"degree amplification degree" in Chinese : 電流放大率
"degree of blame; degree of fault" in Chinese : 過失程度

Examples

This maximum degree of enrichment for any one distillation step is said to represent one theoretical plate .
對于任意一個蒸餾步驟，就稱此最大濃度相當于一個理論板。
The strong chromatic index of graphs with maximum degree
最大度等于5的圖的強邊色數(shù)
The maximum degree of parallelism is configured just like parallel queries
最大并行度的配置與配置并行查詢相同。
Target threat evaluating and sequencing method based on the maximum degree of membership
基于模糊多屬性決策的威脅度評估與排序研究
The maximum degree of parallelism is configured just like that of parallel queries
最大并行度的配置就像并行查詢的最大并行度一樣。
The maximum degree of parallelism is configured in the same manner as that of parallel queries
并行度由查詢處理器自動確定。最大并行度的配置方式與并行查詢相同。
The max degree option on dsntip4 determines the maximum degree of parallelism maximum number of parallel tasks
Dsntip4上的max degree選項決定了最大并行度（并行任務(wù)的最大數(shù)量）。
( 2 ) if the maximum degree of any pair of nonadjacent vertices is at least , then g can be partitioned into k subgraphs hi which hi is a cycle or a path ( 1 i k )
（ 1 ）如果任何一對不相鄰頂點的度和至少為n k ，則g能被剖分成k個子圖從（二三卜k ），其中從是圈或路
A color a e x is legal for an uncolored vertex v e v if by coloring v with a , the subgraph induced by all vertices of color a has maximum degree at most d
對頂點v是合法的，是指由所有染顏色。的頂點導(dǎo)出的子圖的最大度至多是d ，其中alice和bob每走一步都是用合法顏色染未染色點。
We prove that halin graphs , 1 - trees and outerplanar graphs satisfy the conjecture presented by n . alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2
證明了halin圖、 1 -樹和外平面圖滿足由n . alon提出的任何一個圖的無圈邊色數(shù)不超過其最大度加2的猜想。